Extensions of Wythoff’s Game
نویسندگان
چکیده
We determine the maximal set of moves for 2-pile take-away games with prescribed P -positions (bαnc, bβnc) for n ∈ Z≥1 where α ∈ (1, 2) is irrational, 1/α+1/β = 1. This was done in [3] for the special case α = golden ratio. We generalize the infinite Fibonacci word to an infinite wordW with alphabet Σ = {a, b}, in which α replaces the golden ratio, and we analyze the set {s ∈ Z≥0 : W(s) = b, W(s + x) = a} for any fixed value of x.
منابع مشابه
Extensions and restrictions of Wythoff's game preserving its p positions
We consider extensions and restrictions of Wythoff’s game having exactly the same set of P positions as the original game. No strict subset of rules give the same set of P positions. On the other hand, we characterize all moves that can be adjoined while preserving the original set of P positions. Testing if a move belongs to such an extended set of rules is shown to be doable in polynomial tim...
متن کاملGeneral Restriction of (s, t)-Wythoff's Game
A.S. Fraenkel introduced a new (s, t)-Wythoff’s game which is a generalization of both Wythoff’s game and a-Wythoff’s game. Four new models of a restricted version of (s, t)-Wythoff’s game, Odd-Odd (s, t)-Wythoff’s Game, Even-Even (s, t)Wythoff’s Game, Odd-Even (s, t)-Wythoff’s Game and Even-Odd (s, t)-Wythoff’s Game, are investigated. Under normal or misère play convention, all P -positions of...
متن کاملSprague-Grundy Values of the R-Wythoff Game
We examine the Sprague-Grundy values of the game of R-Wythoff, a restriction of Wythoff’s game introduced by Ho, where each move is either to remove a positive number of tokens from the larger pile or to remove the same number of tokens from both piles. Ho showed that the P -positions of R-Wythoff agree with those of Wythoff’s game, and found all positions of Sprague-Grundy value 1. We describe...
متن کاملOn Fraenkel’s N-heap Wythoff’s Conjecture
The N -heap Wythoff’s game is a two-player impartial game with N piles of tokens of sizes A, . . . , A , A ≤ · · · ≤ A . Players take turns removing any number of tokens from a single pile, or removing (a1, . . . , aN ) from all piles — ai tokens from the i-th pile, providing that 0 ≤ ai ≤ A, ∑N i=1 ai > 0 and a1 ⊕ · · · ⊕ aN = 0, where ⊕ is the nim addition. The first player that cannot make a...
متن کاملAnother bridge between Nim and Wythoff
The P positions of both two-heap Nim and Wythoff’s game are easy to describe, more so in the former than in the latter. Calculating the actual G values is easy for Nim but seemingly hard for Wythoff’s game. We consider what happens when the rules for removing from both heaps are modfied in various ways.
متن کاملOn Fraenkel’s N-Heap Wythoff’s Conjectures
The N-heap Wythoff’s game is a two-player impartial game with N piles of tokens of sizes A1, . . . , AN , A1 ≤ ·· · ≤ AN . Players take turns removing any number of tokens from a single pile, or removing (a1, . . . , aN) from all piles — ai tokens from the i-th pile, providing that 0 ≤ ai ≤ Ai, ∑i=1 ai > 0 and a1 ⊕ ·· · ⊕ aN = 0, where ⊕ is the nim addition. The first player that cannot make a ...
متن کامل